vector<int> FindNumsAppearOnce(vector<int>& nums)
{
    int n = nums.size();
    map<int, int> mp;
    vector<int> ans;
    for (int i = 0; i < n; i++)
    {
        mp[nums[i]]++;
    }
    for (int i = 0; i < n; i++)
    {
        if (mp[nums[i]] == 1)
        {
            ans.push_back(nums[i]);
        }
    }
    sort(ans.begin(), ans.end());
    return ans;
}